Degrees of Lookahead in Context-free Infinite Games
نویسندگان
چکیده
We continue the investigation of delay games, infinite games in which one player may postpone her moves for some time to obtain a lookahead on her opponent’s moves. We show that the problem of determining the winner of such a game is undecidable for deterministic context-free winning conditions. Furthermore, we show that the necessary lookahead to win a deterministic context-free delay game cannot be bounded by any elementary function. Both results hold already for restricted classes of deterministic context-free winning conditions. 1998 ACM Subject Classification F.3.1 Specifying and Verifying and Reasoning about Programs; F.4.3 Formal Languages
منابع مشابه
Degrees of Lookahead in Regular Infinite Games
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a finite number of steps, or, in other words, exploit in his strategy some lookahead on the moves of the opponent. This captures situations in distributed systems, e.g. when buffers are present in communication or when s...
متن کاملWhat are Strategies in Delay Games? Borel Determinacy for Games with Lookahead
We investigate determinacy of delay games with Borel winning conditions, infinite-duration twoplayer games in which one player may delay her moves to obtain a lookahead on her opponent’s moves. First, we prove determinacy of such games with respect to a fixed evolution of the lookahead. However, strategies in such games may depend on information about the evolution. Thus, we introduce different...
متن کاملHow Much Lookahead is Needed to Win Infinite Games?
Delay games are two-player games of infinite duration in which one player may delay her moves to obtain a lookahead on her opponent’s moves. For ω-regular winning conditions it is known that such games can be solved in doubly-exponential time and that doublyexponential lookahead is sufficient. We improve upon both results by giving an exponential time algorithm and an exponential upper bound on...
متن کاملUnbounded Lookahead in WMSO+U Games
Delay games are two-player games of infinite duration in which one player may delay her moves to obtain a lookahead on her opponent’s moves. We consider delay games with winning conditions expressed in weak monadic second order logic with the unbounding quantifier (WMSO+U), which is able to express (un)boundedness properties. It is decidable whether the delaying player is able to win such a gam...
متن کاملDelay Games with WMSO+U Winning Conditions
Delay games are two-player games of infinite duration in which one player may delay her moves to obtain a lookahead on her opponent’s moves. We consider delay games with winning conditions expressed in weak monadic second order logic with the unbounding quantifier, which is able to express (un)boundedness properties. We show that it is decidable whether the delaying player has a winning strateg...
متن کامل